Fibonacci Determinants — A Combinatorial Approach
نویسندگان
چکیده
In this paper, we provide combinatorial interpretations for some determinantal identities involving Fibonacci numbers. We use the method due to Lindström-Gessel-Viennot in which we count nonintersecting n-routes in carefully chosen digraphs in order to gain insight into the nature of some well-known determinantal identities while allowing room to generalize and discover new ones.
منابع مشابه
A New Class of q-Fibonacci Polynomials
the simple evaluation (3.2 ). This fact led me to a thorough study of this q-analogue via a combinatorial approach based on Morse code sequences. We show that these q-Fibonacci polynomials satisfy some other recurrences too, generalize some well-known facts for ordinary Fibonacci polynomials to this case, derive their generating function and study the special values Fn(1,−q ) and Fn(1,−1) which...
متن کاملRecounting Determinants for a Class of Hessenberg Matrices
We provide combinatorial interpretations for determinants which are Fibonacci numbers of several recently introduced Hessenberg matrices. Our arguments make use of the basic definition of the determinant as a signed sum over the symmetric group.
متن کاملOn Factorization of the Fibonacci and Lucas Numbers Using Tridiagonal Determinants
The aim of this paper is to give new results about factorizations of the Fibonacci numbers Fn and the Lucas numbers Ln. These numbers are defined by the second order recurrence relation an+2 = an+1+an with the initial terms F0 = 0, F1 = 1 and L0 = 2, L1 = 1, respectively. Proofs of theorems are done with the help of connections between determinants of tridiagonal matrices and the Fibonacci and ...
متن کاملThe 99th Fibonacci Identity
In the book Proofs that Really Count [1], the authors use combinatorial arguments to prove many identities involving Fibonacci numbers, Lucas numbers, and their generalizations. Among these, they derive 91 of the 118 identities mentioned in Vajda’s book [2], leaving 27 identities unaccounted. Eight of these identities, presented later in this paper, have such a similar appearance, the authors r...
متن کاملResistance distance in wheels and fans
Abstract: The wheel graph is the join of a single vertex and a cycle, while the fan graph is the join of a single vertex and a path. The resistance distance between any two vertices of a wheel and a fan are obtained. The resistances are related to Fibonacci numbers and generalized Fibonacci numbers. The derivation is based on evaluating determinants of submatrices of the Laplacian matrix. A com...
متن کامل